compar studi practic stochast cluster method tradit method detect cluster anomali sciforest mass estim applic learn naiv bay classifi music classif retriev mass estim applic featur combin music classif paper pacif dasia confer knowledg discoveri data mine pakdd fass ensembl stabl learner boost support vector machin successfulli advanc knowledg discoveri data mine isol forest aim studi assess impact isol forest bird commun agricultur land scape netherland studi avifauna small ha compos matur decidu tree select eastern central southern part countri region show great differ landscap structur degre isol multipl regress analysi size singl predictor speci number probabl occurr speci turn isol variabl area wood number wood interpatch distanc proxim densiti connect element explain small signific part residu varianc speci number singl speci significantli affect densiti connect element biogeograph differ group region emphas evid woodland speci suggest region abund affect probabl occurr small isol issu grid dcluster retriev swarm dbase cluster spectrum variabl drandom tree examin dissimilar scale ant coloni approach data cluster cocktail ensembl regress select weigh compar studi linear combin scheme superpar ddepend estim conduct larg scale compar studi linearli combin superpar depend estim spode popular famili semi naiv bayesian classifi altogeth model select weigh scheme benchmark data set statist test emploi paper main contribut fold formal present scheme definit rational time complex serv comprehens refer research interest ensembl learn offer bia varianc analysi scheme classif error perform identifi effect scheme meet practic lead accur fast classif algorithm signific impact real world applic import featur studi varieti statist test evalu multipl learn method multipl data set classifi comput resourc constraint anytim classif probabilist estim onlin applic machin learn comput resourc classif vari time time techniqu design oper constraint minimum expect resourc fail util resourc propos anytim classif algorithm anytim averag probabilist estim aap capabl deliv strong predict accuraci cpu time util addit cpu time increas classif accuraci idea run order sequenc effici bayesian probabilist estim singl improv step classif time run theoret studi empir valid reveal properli identifi order invok ensembl singl improv step aap accomplish accur classif interrupt output class probabl estim simpl loss classif adeptli handl increment learn ehipasiko content dbase imag index retriev system dsvm svm improv classif imbalanc data select weigh compar studi model select model weigh spode ensembl ensembl super parent depend estim spode offer power simpl altern naiv bay classifi achiev significantli higher classif accuraci moder cost classif effici exist famili methodolog ensembl candid spode classif select help spode uniformli averag probabl estim type model select assign weight spode linearli combin probabl estim methodolog name model weigh paper present theoret empir studi compar model select model weigh ensembl spode focu maxim ensembl classif accuraci minim comput time number repres select weigh scheme studi provid comprehens research topic identifi effect scheme provid altern trade speed expect error variabl random decis tree ensembl ensembl select superpar ddepend estim maxim tree divers build complet drandom decis tree applic roc analysi predict classif perform vari class distribut counsel caution applic roc analysi predict classifi perform vari class distribut argu reason expect roc analysi provid accur predict model perform vari distribut class causal relev subclass frequenc vari di erent rate attribut class causal depend improv center cusum statist structur break detect time seri match model versu singl model studi requir match class distribut decis tree model stabil kei factor determin algorithm produc optim model match distribut studi adaboost naiv bayesian classifi weak improv studi effect class distribut cost dsensit learn issu classifi evalu optim cost curv instanc dweight method induc cost dsensit tree abstract class imbal challeng problem machin learn algorithm learn highli imbalanc data classifi overwhelm major class exampl fals neg rate high research introduc method deal problem includ resampl techniqu costsensit learn csl focu techniqu studi present empir method deal class imbal resampl csl method combin compar sampl techniqu csl support vector machin svm method propos csl optim cost ratio cost matrix local experiment result imbalanc dataset uci repositori show method reduc misclassif cost method improv classifi perform empir studi metacost boost algorithm metacost recent propos procedur convert error base learn algorithm cost sensit algorithm paper investig import issu center procedur paper propos metacost comparison made metacost final model intern cost sensit classifi metacost depend credibl intern cost sensit classifi outperform final model addit comput requir deriv final model metacost assum intern cost sensit classifi obtain appli minimum expect cost criterion unclear violat assumpt impact metacost perform studi issu boost procedur compar perform origin form metacost emploi bag compar studi cost dsensit boost algorithm paper describ studi adapt boost algorithm cost sensit classif purpos studi improv understand behavior cost sensit boost algorithm variat boost procedur affect misclassif cost high cost error find boost simplifi cost sensit classif variant exclud factor ordinari boost perform minim high cost error perform adaboost find cost sensit boost seek minim high cost error cost minimum expect cost criterion appli classif greatli enhanc perform cost sensit adapt boost algorithm show strong correl algorithm produc small model size success reduc high cost error recent propos method adacost lazi bayesian rule lazi semi dnaiv bayesian learn techniqu competit boost decis tree lbr lazi semi naiv bayesian classifi learn techniqu design allevi attribut interdepend problem naiv bayesian classif classifi test creat conjunct rule select subset train exampl induc local naiv bayesian classifi subset lbr significantli improv perform naiv bayesian classifi bia varianc analysi lbr reveal significantli reduc bia naiv bayesian classif cost slight increas varianc interest compar lazi techniqu boost bag state art lazi learn techniqu empir comparison lbr boost decis tree discret valu data show lbr averag significantli lower varianc higher bia result interact effect averag predict error lbr rang learn task improv perform boost naiv bayesian classif paper investig boost naiv bayesian classif show boost improv accuraci naiv bayesian classifi averag set natur domain analyz reason boost failur propos introduc tree structur naiv bayesian classif improv perform boost work naiv bayesian classif experiment result show introduc tree structur naiv bayesian classif increas averag error naiv bayesian classif individu model boost naiv bayesian classifi tree structur achiev significantli lower averag error naiv bayesian classifi provid method successfulli appli boost techniqu naiv bayesian classif introduct kdd applic predict classif accuraci primari concern recent studi boost techniqu brought issu stack gener stack gener gener method high level model combin lower level model achiev greater predict accuraci paper address crucial issu consid black art classif task introduct stack gener wolpert type gener suitabl deriv higher level model kind attribut input find result obtain higher level model combin confid predict lower level learn batch data model combin versu data combin boost cost dsensit tree paper explor techniqu boost cost sensit tree techniqu differ misclassif cost inform util train demonstr techniqu good aspect cost sensit classif show techniqu provid mean overcom weak base cost sensit tree induct algorithm introduct cost sensit classif deal situat type incorrect predict cost differ cost incorrect predict import number incorrect predict real world applic medic diagnosi cost commit diagnos healthi life threaten diseas consid higher type error diagnos ill fact healthi type error type error boost tree cost dsensit classif paper explor boost techniqu cost sensit tree classif situat misclassif cost chang ideal induct induc model misclassif cost demand robust induc model cost combin multipl tree robust predict chang demonstr ordinari boost combin minimum expect cost criterion select predict class good solut situat introduc variant ordinari boost procedur util cost inform train show propos techniqu perform ordinari boost term misclassif cost techniqu requir induc set tree time cost empir investig reveal interest behavior boost decis tree cost sensi induc cost dsensit tree instanc weight model combin multipl ddata dbatch scenario approach combin model learn multipl batch data provid altern common practic learn model data data combin approach paper empir examin base line behaviour model combin approach multipl data batch scenario find model combin lead perform disjoint batch data drawn randomli larger sampl relat rel perform approach learn curv classifi practic implic result model combin data combin multipl batch data task readili interest result empir show nearasymptot perform singl model classif task significantli improv combin multipl model deriv stack bag dag model paper investig method stack gener combin model deriv subset train dataset singl learn algorithm algorithm simplest combin predict compet model major vote effect sampl regim gener train subset studi context bootstrap sampl method call bag disjoint sampl call dag paper extend studi stack gener learn algorithm emploi combin model yield method dub bag stack dag stack demonstr bag stack dag stack effect classif task train sampl cover small fraction full dataset contrast earlier bag result show bag bag stack work stabl unstabl learn algorithm stack gener work stack gener gener method high level model combin lower level model achiev greater predict accuraci paper address crucial issu consid black art classif task introduct stack gener wolpert type gener suitabl deriv higher level model kind attribut input demonstr effect stack gener combin type learn algorithm discretis lazi learn algorithm decis combin base characteris predict accuraci characteris predict accuraci decis combin paper explor intrins problem exist theori induc learn algorithm select algorithm search methodolog hypothesi represent theori induc expect theori make predict region descript space term fact induc theori region poor perform problem local low predict accuraci characteris problem local low predict accuraci instanc base naiv bayesian classifi propos counter problem composit learner incorpor classifi strategi select estim perform classifi final predict classif empir result show strategi capabl partial overcom problem time improv perform constitu classifi pro singl uniform metric instanc dbase learn dof dn rule induct algorithm applic dna domain 